Invariant representative cocycles of cohomology generators using irregular graph pyramids
نویسندگان
چکیده
منابع مشابه
Invariant representative cocycles of cohomology generators using irregular graph pyramids
Structural pattern recognition describes and classifies data based on the relationships of features and parts. Topological invariants, like the Euler number, characterize the structure of objects of any dimension. Cohomology can provide more refined algebraic invariants to a topological space than does homology. It assigns ‘quantities’ to the chains used in homology to characterize holes of any...
متن کاملIrregular Graph Pyramids and Representative Cocycles of Cohomology Generators
Structural pattern recognition describes and classifies data based on the relationships of features and parts. Topological invariants, like the Euler number, characterize the structure of objects of any dimension. Cohomology can provide more refined algebraic invariants to a topological space than does homology. It assigns ‘quantities’ to the chains used in homology to characterize holes of any...
متن کاملComputing Homology Group Generators of Images Using Irregular Graph Pyramids
We introduce a method for computing homology groups and their generators of a 2D image, using a hierarchical structure i.e. irregular graph pyramid. Starting from an image, a hierarchy of the image is built, by two operations that preserve homology of each region. Instead of computing homology generators in the base where the number of entities (cells) is large, we first reduce the number of ce...
متن کاملLBP and Irregular Graph Pyramids
In this paper, a new codification of Local Binary Patterns (LBP) is given using graph pyramids. The LBP code characterizes the topological category (local max, min, slope, saddle) of the gray level landscape around the center region. Given a 2D grayscale image I, our goal is to obtain a simplified image which can be seen as “minimal” representation in terms of topological characterization of I....
متن کاملDirectly computing the generators of image homology using graph pyramids
We introduce a method for computing homology groups and their generators of a 2D image, using a hierarchical structure, i.e. irregular graph pyramid. Starting from an image, a hierarchy of the image is built by two operations that preserve homology of each region. Instead of computing homology generators in the base where the number of entities (cells) is large, we first reduce the number of ce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Vision and Image Understanding
سال: 2011
ISSN: 1077-3142
DOI: 10.1016/j.cviu.2010.12.009